The Geometry of Homogeneous Two-Weight Codes
نویسنده
چکیده
The results of [1, 2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1, 2]. Secondly, these codes are used to define a dual two-weight code and strongly regular graph similar to the classical case of projective linear two-weight codes over finite fields [3].
منابع مشابه
Ring geometries, two-weight codes, and strongly regular graphs
It is known that a linear two-weight code C over a finite field Fq corresponds both to a multiset in a projective space over Fq that meets every hyperplane in either a or b points for some integers a < b , and to a strongly regular graph whose vertices may be identified with the codewords of C . Here we extend this classical result to the case of a ring-linear code with exactly two nonzero homo...
متن کاملSeveral Classes of $p$-ary Linear Codes with Few Weights
Few weights codes have been an important topic of coding theory for decades. In this paper, a class of two-weight and three-weight codes for the homogeneous metric over the chain ring R = Fp + uFp + · · ·+ uFp are constructed. These codes are defined as trace codes. They are shown to be abelian. Their homogeneous weight distributions are computed by using exponential sums. In particular, we giv...
متن کاملA class of optimal p-ary codes from one-weight codes over Fp[u]/amp#x02329;umamp#x0232A;
We characterize the structures and properties of one-homogeneous weight linear codes Ck1,...,km over Fp1⁄2u =/uS of type 11pk2 ðp 1Þm with one unique nonzero weight w0. We introduce a distance-preserving Gray map from ðFp1⁄2u =/umSÞ to F m n p . By the Gray map, we obtain a class of optimal p-ary one-Hamming weight linear codes from one-homogeneous weight linear codes over Fp1⁄2u =/uS. We concl...
متن کاملNew Classes of $p$-ary Few Weights Codes
In this paper, we construct an infinite family of two-weight codes for the homogeneous metric over the ring R = F2 + uF2 + · · · + u k−1 F2, where u k = 0. These codes are defined as trace codes. They have the algebraic structure of abelian codes. Their homogeneous weight distribution is computed by using character sums. In particular, we give a necessary and sufficient condition of optimality ...
متن کاملLinear Codes over Galois Ring GR(p2, r) Related to Gauss sums
Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-like properties are the images of Gray map of linear codes over Z4. In this paper we consider two series of linear codes C(G) and C̃(G) over Galois ring R = GR(p2,r), where G is a subgroup of R(s) ∗ and R(s) = GR(p2,rs...
متن کامل